Simplex graph

Results: 31



#Item
11CCCG 2004, Montreal, Quebec, August 9–11, 2004  Using Bistellar Flips for Rotations in Point Location Structures 

CCCG 2004, Montreal, Quebec, August 9–11, 2004 Using Bistellar Flips for Rotations in Point Location Structures 

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
12CCCG 2007, Ottawa, Ontario, August 20–22, 2007  Restricted Edge Contractions in Triangulations of the Sphere with Boundary Masaki Moriguchi  ∗

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Restricted Edge Contractions in Triangulations of the Sphere with Boundary Masaki Moriguchi ∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:29:58
135 th AGILE Conference on Geographic Information Science, Palma (Mallorca, Spain) April 25th-27 thExamination of Database Supported Spatio-Temporal Intersection Queries* Martin Breunig2 , Armin B. Cremers 1 , Wolfg

5 th AGILE Conference on Geographic Information Science, Palma (Mallorca, Spain) April 25th-27 thExamination of Database Supported Spatio-Temporal Intersection Queries* Martin Breunig2 , Armin B. Cremers 1 , Wolfg

Add to Reading List

Source URL: itcnt05.itc.nl

Language: English - Date: 2008-09-22 04:56:58
14Topology Preserving Graph Matching Jeffrey Byrne Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 {jebyrne}@cis.upenn.edu

Topology Preserving Graph Matching Jeffrey Byrne Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 {jebyrne}@cis.upenn.edu

Add to Reading List

Source URL: www.jeffreybyrne.com

Language: English - Date: 2013-05-01 13:34:08
15Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Add to Reading List

Source URL: www.math.ku.dk

Language: English - Date: 2011-06-02 03:40:55
16Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Add to Reading List

Source URL: www.math.ku.dk

Language: English - Date: 2011-11-04 06:42:35
17The triangulation is based on Delaunay method, creating the corresponding Voronoi polygons and is tested to process 1 million of points in less than 10 seconds (din referat) -> continuare Triangulation definition The mea

The triangulation is based on Delaunay method, creating the corresponding Voronoi polygons and is tested to process 1 million of points in less than 10 seconds (din referat) -> continuare Triangulation definition The mea

Add to Reading List

Source URL: www.landtm.com

Language: English - Date: 2010-09-16 08:25:59
18Microsoft Word - _agileproceedings0402.doc

Microsoft Word - _agileproceedings0402.doc

Add to Reading List

Source URL: www.agile-online.org

Language: English - Date: 2006-04-11 10:55:56
19IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 11, NOVEMBER[removed]MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 11, NOVEMBER[removed]MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2005-11-06 17:30:54
20Almost-Delaunay Simplices: Nearest Neighbor Relations for Imprecise Points Deepak Bandyopadhyay ∗ Jack Snoeyink†

Almost-Delaunay Simplices: Nearest Neighbor Relations for Imprecise Points Deepak Bandyopadhyay ∗ Jack Snoeyink†

Add to Reading List

Source URL: www.cs.unc.edu

Language: English - Date: 2003-10-09 16:02:36